Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
301	Finding Connected Subgraphs of Fixed Minimum Density: Implementation and Experiments? Christian Komusiewicz, Manuel Sorge, and Kolja Stahl Institut f¨ ur Softwaretechnik und Theoretische Informatik, TU Berlin, Germany Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-06-25 05:19:55 Graph theory NP-complete problems Graph operations Clique Degeneracy Tree Degree Vertex Neighbourhood Clique problem BronKerbosch algorithm
302	Contemporary Mathematics Graph Partitioning for Scalable Distributed Graph Computations Aydın Bulu¸c and Kamesh Madduri Abstract. Inter-node communication time constitutes a significant fraction Add to Reading List Source URL: gauss.cs.ucsb.edu Language: English - Date: 2013-03-15 01:10:50 Graph theory Mathematics NP-complete problems Graph partition Hypergraph Graph traversal Breadth-first search Vertex Graph Shortest path problem Ear decomposition HopcroftKarp algorithm
303	Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees Charalampos E. Tsourakakis1 Francesco Bonchi2 Aristides Gionis3 2 Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-06-09 08:58:15 Graph theory NP-complete problems Dense subgraph Clique BronKerbosch algorithm Cograph Modular product of graphs
304	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-10-07 11:22:31 Graph theory NP-complete problems Graph connectivity Graph operations Graph coloring Degeneracy Tree Neighbourhood Clique K-edge-connected graph Vertex cover Degree
305	PDF Document Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2015-05-03 06:37:17 Graph theory NP-complete problems Clique Independent set Split graph Neighbourhood Bipartite graph Degree Vertex Graph Line graph Chordal graph
306	PDF Document Add to Reading List Source URL: www.francescobonchi.com Language: English - Date: 2013-10-23 04:38:55 Graph theory Directed graph Flow network Edsger W. Dijkstra Network theory NP-complete problems
307	Protein Engineering vol.15 no.10 pp.779–782, 2002 Protein Design is NP-hard Niles A.Pierce1,2 and Erik Winfree3 1Applied Add to Reading List Source URL: www.piercelab.caltech.edu Language: English - Date: 2010-09-08 02:56:32 Complexity classes Mathematical optimization NP-complete problems Structural complexity theory NP-hard NP-complete Dead-end elimination NP P Theoretical computer science Computational complexity theory Applied mathematics
308	The Community-search Problem and How to Plan a Successful Cocktail Party ∗ Mauro Sozio Add to Reading List Source URL: research.yahoo.com Language: English - Date: 2013-04-05 04:39:54 NP-complete problems Graph operations Graph coloring Dense subgraph Graph partition Community structure Tree Shortest path problem Graph Graph theory Theoretical computer science Mathematics
309	Daniel Delany Theory of ComputationClassifications in Computational Complexity Theory In the theory of computation, one often analyzes “computational problems,” that is, questions Add to Reading List Source URL: cognitiveharmony.net Language: English - Date: 2008-09-30 17:00:23 Complexity classes NP-hard NP-complete NP P versus NP problem P Reduction Decision problem Oracle machine Theoretical computer science Computational complexity theory Applied mathematics
310	Sage Reference Manual: Graph Theory Release 6.7 The Sage Development Team June 24, 2015 Add to Reading List Source URL: doc.sagemath.org Language: English - Date: 2015-06-24 05:21:38 Graph Neighbourhood Adjacency matrix Line graph Directed acyclic graph Hamiltonian path Eulerian path Tree Independent set Graph theory Mathematics NP-complete problems

UPDATE